Fibers Having Fine Concave and Convex Surface from Silica Hybrid Polyester.
نویسندگان
چکیده
منابع مشابه
Locally Convex (concave) Games
We introduce a new class of cooperative games by using the notion of local supermodularity. Therefore locally convex games can be considered as relaxations of convex games. Moreover, we obtain a characterization of a subclass of locally concave games in terms of the rank function of a matroid.
متن کاملStrength and surface characterization of aluminum-coated fused silica fibers
Hermetic aluminum-coated fused silica fibers can withstand high stress levels without failure for prolonged periods of time in water-containing environments. Aluminum-coated fibers from several sources exhibit differences in strength. The aluminum and silica surfaces have been examined using SEM and AFM in order to understand this variation. Differences in the interfacial interaction between al...
متن کاملShort Proofs of the Separation Theorems for L-convex/concave and M-convex/concave Functions
Recently K. Murota has introduced concepts of L-convex function and Mconvex function as generalizations of those of submodular function and base polyhedron, respectively, and has shown separation theorems for L-convex/concave functions and for M-convex/concave functions. The present note gives short alternative proofs of the separation theorems by relating them to the ordinary separation theore...
متن کاملThe Concave-Convex Procedure (CCCP)
We introduce the Concave-Convex procedure (CCCP) which constructs discrete time iterative dynamical systems which are guaranteed to monotonically decrease global optimization/energy functions. It can be applied to (almost) any optimization problem and many existing algorithms can be interpreted in terms of CCCP. In particular, we prove relationships to some applications of Legendre transform te...
متن کاملConvex-Round and Concave-Round Graphs
We introduce two new classes of graphs which we call convex-round, respectively concave-round graphs. Convex-round (concave-round) graphs are those graphs whose vertices can be circularly enumerated so that the (closed) neighborhood of each vertex forms an interval in the enumeration. Hence the two classes transform into each other by taking complements. We show that both classes of graphs have...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: FIBER
سال: 2001
ISSN: 0037-9875
DOI: 10.2115/fiber.57.111